Completeness Theorem for a Logic with Imprecise and Conditional Probabilities
نویسندگان
چکیده
We present a propositional probability logic which allows making formulas that speak about imprecise and conditional probabilities. A class of Kripke-like probabilistic models is defined to give semantics to probabilistic formulas. Every possible world of such a model is equipped with a probability space. The corresponding probabilities may have nonstandard values. The proposition “the probability is close to r” means that there is an infinitesimal 2, such that the probability is equal to r−2 (or r+2). We provide an infinitary axiomatization and prove the corresponding extended completeness theorem.
منابع مشابه
A Logic with Kolmogorov Style Conditional Probabilities
In this paper we investigate a probability logic with conditional probability operators. The logic (denoted LPP ) allows making statements such as CP≥s(α | β), with the intended meaning ”the conditional probability of α given β is at least s”. Conditional probabilities are defined in the usual Kolmogorv style: P (α | β) = P (α∧β) P (β) , P (β) > 0. A possible-world approach is used to give sema...
متن کاملImprecise probabilities based on generalized intervals for system reliability assessment
Di erent representations of imprecise probabilities have been proposed, where interval-valued probabilities are used such that uncertainty is distinguished from variability. In this paper, we present a new form of imprecise probabilities for reliability assessment based on generalized intervals. Generalized intervals have group properties under the Kaucher arithmetic, which provides a concise r...
متن کاملThe concept of logic entropy on D-posets
In this paper, a new invariant called {it logic entropy} for dynamical systems on a D-poset is introduced. Also, the {it conditional logical entropy} is defined and then some of its properties are studied. The invariance of the {it logic entropy} of a system under isomorphism is proved. At the end, the notion of an $ m $-generator of a dynamical system is introduced and a version of the Kolm...
متن کاملA probabilistic approach to default reasoning
A logic is defined which in addition to propositional calculus contains several types of probabilistic operators which are applied only to propositional formulas. For every s ∈ S, where S is the unit interval of a recursive nonarchimedean field, an unary operator P≥s(α) and binary operators CP=s(α, β) and CP≥s(α, β) (with the intended meaning ”the probability of α is at least s”, ”the condition...
متن کاملDe Finetti Coherence and Beyond
The aim of the tutorial is to present the concept of coherence, which dates back to de Finetti, showing its role in managing incomplete (or missing) information. We will start recalling the notion of coherence for (unconditional) probabilities and the related fundamental theorem. Then, in order to generalize this notion to assessments on a set of conditional events, the axiomatic definition of ...
متن کامل